Hierarchical Mixed Integer Programming for Pack-to-Swad Placement in Datacenters: Concept and Analysis
نویسندگان
چکیده
Computational clouds have evolved to go beyond cost-effective on-demand hosting of IT resources and elasticity. The added features now include the ability to offer entire IT systems as a service that can quickly adapt to changing business environments. The new trend introduces challenges in datacenter resource management, including scalability, system-orientation, and optimization supporting both datacenter efficiency and customer system agility and performance. The conventional VMcentric approach of resource management adopts a flat finegrained model that results in problem formulations of enormous sizes. The difficulty in scalability hinders cloud providers’ ability to improve resource efficiency and workload performance. In this paper, we introduce a pack-centric approach to datacenter resource management by abstracting a system as a pack of resources and considering the mapping of these packs onto physical datacenter resource groups, called swads. The assignment of packs/VMs to swads/PMs is formulated as an integer optimization problem that can capture constraints related to the available resources, datacenter efficiency and customers’ complex requirements. Scalability is achieved through a hierarchical decomposition method. The new datacenter resource management framework is illustrated with a concrete resource allocation problem, which is interesting by itself and challenging. The problem formulation, our solution, and numerical experiments show the capability of integer programming formulations, the scalability of the hierarchical decomposition method, and the benefits of the overall framework.
منابع مشابه
ALTERNATIVE MIXED INTEGER PROGRAMMING FOR FINDING EFFICIENT BCC UNIT
Data Envelopment Analysis (DEA) cannot provide adequate discrimination among efficient decision making units (DMUs). To discriminate these efficient DMUs is an interesting research subject. The purpose of this paper is to develop the mix integer linear model which was proposed by Foroughi (Foroughi A.A. A new mixed integer linear model for selecting the best decision making units in data envelo...
متن کاملA mixed integer linear programming formulation for a multi-stage, multi-Product, multi-vehicle aggregate production-distribution planning problem
In today’s competitive market place, companies seek an efficient structure of supply chain so as to provide customers with highest value and achieve competitive advantage. This requires a broader perspective than just the borders of an individual company during a supply chain. This paper investigates an aggregate production planning problem integrated with distribution issues in a supply chain ...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملA Non-radial Approach for Setting Integer-valued Targets in Data Envelopment Analysis
Data Envelopment Analysis (DEA) has been widely studied in the literature since its inception with Charnes, Cooper and Rhodes work in 1978. The methodology behind the classical DEA method is to determine how much improvements in the outputs (inputs) dimensions is necessary in order to render them efficient. One of the underlying assumptions of this methodology is that the units consume and prod...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015